Non‐Clairvoyant Dynamic Mechanism Design
نویسندگان
چکیده
منابع مشابه
Stochastic dynamic mechanism design
We deal with scheduling-type multi-agent projects, where the workflow of each task may contain chance events and decision opportunities. In this case, global efficiency requires each agent to make his decisions depending on all the current states of the work processes of all agents. But if the current state of each task is hidden then we also need to get the agents interested in sharing this in...
متن کاملRobust Dynamic Mechanism Design
In situations in which the social planner has to make several decisions over time, before agents have observed all the relevant information, static mechanisms may not su¢ ce to induce agents to reveal their information truthfully. This paper focuses on questions of partial and full implementation in dynamic mechanisms, when agents beliefs are unknown to the designer (hence the term robust). ...
متن کاملDynamic Mechanism Design∗
We study the design of incentive-compatible mechanisms in general dynamic environments where information arrives gradually over time and decisions are made over multiple periods. Our first main result is a necessary condition for incentive compatibility that takes the form of an envelope formula for the derivative of an agent’s equilibrium expected payoff with respect to his current type. It co...
متن کاملDynamic Mechanism Design: An Introduction∗
We provide an introduction into the recent developments of dynamic mechanism design with a primary focus on the quasilinear case. First, we describe socially optimal (or effi cient) dynamic mechanisms. These mechanisms extend the well known Vickrey-Clark-Groves and D’Aspremont-Gérard-Varet mechanisms to a dynamic environment. Second, we discuss results on revenue optimal mechanism. We cover mod...
متن کاملUtilization of nonclairvoyant online schedules
This paper addresses the analysis of nondelay, nonpreemptive, nonclairvoyant online schedules for independent jobs onm identical machines. In our online model, all jobs are submitted over time. We show that the commonly used makespan criterion is not well suited to describe utilization for this online problem. Therefore, we directly address utilization and determine themaximum deviation from th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Econometrica
سال: 2020
ISSN: 0012-9682
DOI: 10.3982/ecta15530